Stochastic analysis of a single server unreliable queue with balking and general retrial time
نویسندگان
چکیده
منابع مشابه
Stochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملstochastic bounds for a single server queue with general retrial times
we propose to use a mathematical method based on stochastic comparisons of markov chains in order to derive performance indice bounds. the main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (fcfs) orbit and general retrial times using the stochastic ordering techniques.
متن کاملUnreliable Server Mx/G/1 Queue with Loss-delay, Balking and Second Optional Service
This investigation deals with MX/G/1 queueing model with setup, bulk- arrival, loss-delay and balking. The provision of second optional service apart from essential service by an unreliable server is taken into consideration. We assume that the delay customers join the queue when server is busy whereas loss customers depart from the system. After receiving the essential service, the customers m...
متن کاملPerformance Analysis of Single Server Retrial Queue with General Retrial Time, Impatient Subscribers, Two Phases of Service and Bernoulli Schedule
This paper analyses the steady state behaviour of an M/G/1 retrial queue with impatient subscribers, two phases of essential service, general retrial time and general vacation time. If the primary call, on arrival finds the server busy, becomes impatient and leaves the system with probability (1 ) and with probability , it enters into an orbit. The server provides preliminary first essential se...
متن کاملAn M/M/1 retrial queue with unreliable server
We analyze an unreliable M/M/1 retrial queue with infinite-capacity orbit and normal queue. Retrial customers do not rejoin the normal queue but repeatedly attempt to access the server at i.i.d. intervals until it is found functioning and idle. We provide stability conditions as well as several stochastic decomposability results. © 2005 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Continuous Models and Applied Computational Science
سال: 2020
ISSN: 2658-7149,2658-4670
DOI: 10.22363/2658-4670-2020-28-4-319-326